Complexity of single machine scheduling problems under scenario-based uncertainty
نویسندگان
چکیده
We consider scheduling environments where some job characteristics are uncertain. This uncertainty is modeled through a finite set of well-defined scenarios. In such a context, we search for a solution that is acceptable for any considered scenario. For this purpose, several criteria can be applied to select among solutions. We use here the so-called absolute robustness criterion. We present algorithmic and computational complexity results for several single machine scheduling problems.
منابع مشابه
On the complexity of single machine scheduling problems under scenario - based uncertainty 1
We consider scheduling environments where some job characteristics are uncertain. This uncertainty is modeled through a finite set of well-defined scenarios. In such a context, we search for a solution that is acceptable for any considered scenario. For this purpose, several criteria can be applied to select among solutions. We use here the so-called absolute robustness criterion. We present al...
متن کاملMinimizing the Number of Tardy Jobs in the Single Machine Scheduling Problem under Bimodal Flexible and Periodic Availability Constraints
In single machine scheduling problems with availability constraints, machines are not available for one or more periods of time. In this paper, we consider a single machine scheduling problem with flexible and periodic availability constraints. In this problem, the maximum continuous working time for each machine increases in a stepwise manner with two different values allowed. Also, the durati...
متن کاملIntegrated Inspection Planning and Preventive Maintenance for a Markov Deteriorating System Under Scenario-based Demand Uncertainty
In this paper, a single-product, single-machine system under Markovian deterioration of machine condition and demand uncertainty is studied. The objective is to find the optimal intervals for inspection and preventive maintenance activities in a condition-based maintenance planning with discrete monitoring framework. At first, a stochastic dynamic programming model whose state variable is the ...
متن کاملComplexity of non-preemptive single machine scheduling problems in the presence of uncertainty
This paper deals with single machine scheduling problems where some job characteristics are uncertain. This uncertainty is described through a finite set S of well-defined scenarios. We denote by pj , d s j and w s j , respectively, the processing time, the due date and the weight of job j under scenario s ∈ S. Consider a scheduling problem, denoted by α|β|γ according to Graham et al. notation ...
متن کاملSingle-machine scheduling considering carryover sequence-dependent setup time, and earliness and tardiness penalties of production
Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Oper. Res. Lett.
دوره 36 شماره
صفحات -
تاریخ انتشار 2008